Lecture 24 : QMA : Quantum Merlin - Arthur

Given a string x and a decision problem L, there is an omniscient prover who sends a string π ∈ {0, 1} to a polytime deterministic algorithm called a verifier V , and V (x, π) runs in polynomial time and returns 1 if x is a YES-instance and 0 if x is a NO-instance. The verifier must satisfy the properties of soundness and completeness: in particular, if x is a YES-instance of L, then there exists π for which V (x, π) = 1 and if x is a NO-instance of L, then for any π that the prover sends, V (x, π) = 0.